Terminal Backup, 3D Matching, and Covering Cubic Graphs
نویسندگان
چکیده
منابع مشابه
Terminal Backup , 3 D Matching , and Covering
We define a problem called Simplex Matching and show that it is solvable in polynomial time. While Simplex Matching is interesting in its own right as a nontrivial extension of nonbipartite min-cost matching, its main value lies in many (seemingly very different) problems that can be solved using our algorithm. For example, suppose that we are given a graph with terminal nodes, nonterminal node...
متن کاملLocation-domination and matching in cubic graphs
A dominating set of a graph G is a set D of vertices of G such that every vertex outside D is adjacent to a vertex in D. A locating-dominating set of G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩ D 6= N(v) ∩ D where N(u) denotes the open neighborhood of u...
متن کاملCovering cubic graphs with matchings of large size
Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called the excessive [m]-index of G in the literature. The case m = n, that is, a covering with perfect matchings, is known to be strictly related to an outstanding conjecture of Berge and Fulkerson. In this pape...
متن کاملRIMS - 1731 Covering Cuts in Bridgeless Cubic Graphs
In this paper we are interested in algorithms for finding 2-factors that cover certain prescribed edge-cuts in bridgeless cubic graphs. We present an algorithm for finding a minimum-weight 2-factor covering all the 3-edge cuts in weighted bridgeless cubic graphs, together with a polyhedral description of such 2-factors and that of perfect matchings intersecting all the 3-edge cuts in exactly on...
متن کاملThe Generalized Terminal Backup Problem
We consider the following network design problem, that we call the Generalized Terminal Backup Problem: given a graph (or a hypergraph) G0 = (V,E0), a set of (at least 2) terminals T ⊆ V and a requirement r(t) for every t ∈ T , nd a multigraph G = (V,E) such that λG0+G(t, T − t) ≥ r(t) for any t ∈ T . In theminimum cost version the objective is to nd G minimizing the total cost c(E) = ∑ uv∈E c(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2011
ISSN: 0097-5397,1095-7111
DOI: 10.1137/090752699